Recovering zeros of polynomials modulo a prime
نویسندگان
چکیده
Let p be a prime and Fp the finite field with p elements. We show how, when given an irreducible bivariate polynomial F ∈ Fp[X,Y ] and an approximation to a zero, one can recover the root efficiently, if the approximation is good enough. The strategy can be generalized to polynomials in the variables X1, . . . , Xm over the field Fp. These results have been motivated by the predictability problem for non-linear pseudorandom number generators and other potential applications to cryptography.
منابع مشابه
A strategy for recovering roots of bivariate polynomials modulo a prime
We show how, when given an irreducible bivariate polynomial with coefficients in a finite prime field and an approximation to one of its roots, one can recover that root efficiently, if the approximation is good enough. This result has been motivated by the predictability problem for non-linear pseudorandom number generators and other potential applications to cryptography.
متن کاملInterpolation and Approximation of Polynomials in Finite Fields over a Short Interval from Noisy Values
Motivated by a recently introduced HIMMO key distribution scheme, we consider a modification of the noisy polynomial interpolation problem of recovering an unknown polynomial f(X) ∈ Z[X] from approximate values of the residues of f(t) modulo a prime p at polynomially many points t taken from a short interval.
متن کاملOn transitive polynomials modulo integers
A polynomial P (x) with integer coefficients is said to be transitive modulo m, if for every x, y ∈ Z there exists k ≥ 0 such that P (x) = y (mod m). In this paper, we construct new examples of transitive polynomials modulo prime powers and partially describe cubic and quartic transitive polynomials. We also study the orbit structure of affine maps modulo prime powers.
متن کاملSome compact generalization of inequalities for polynomials with prescribed zeros
Let $p(z)=z^s h(z)$ where $h(z)$ is a polynomial of degree at most $n-s$ having all its zeros in $|z|geq k$ or in $|z|leq k$. In this paper we obtain some new results about the dependence of $|p(Rz)|$ on $|p(rz)| $ for $r^2leq rRleq k^2$, $k^2 leq rRleq R^2$ and for $Rleq r leq k$. Our results refine and generalize certain well-known polynomial inequalities.
متن کاملNull Polynomials modulo m
This paper studies so-called “null polynomials modulo m”, i.e., polynomials with integer coefficients that satisfy f(x) ≡ 0 (mod m) for any integer x. The study on null polynomials is helpful to reduce congruences of higher degrees modulo m and to enumerate equivalent polynomial functions modulo m, i.e., functions over Zm = {0, · · · , m − 1} generated by integer polynomials. The most well-know...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Comput.
دوره 83 شماره
صفحات -
تاریخ انتشار 2014